#include <bits/stdc++.h>
using namespace std;
int shao[100005];
struct jj{
    int bh,r;
}j[100005];
int n;
/*void p(){
    for(int i = 0 ; i < n ; ++i){
        for(int o = i ; o < n ; ++ o){
            if(j[i].r > j[o].r){
                int pp = j[o].r;
                j[o].r = j[i].r;
                j[i].r = pp;
                int kk = j[o].bh;
                j[o].bh = j[i].bh;
                j[i].bh = kk;
            }
        }
    }
}*/

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    cin >> n;
    for(int i = 0 ; i < n ; ++ i){
        int k;
        cin >> k;
        j[i].bh = 1;//we i gong ji
        shao[i] = k;

    }

    sort(shao,shao+n);
    for(int i = 0 ; i < n ; ++ i){
        j[i].r = shao[i];
    }
    for(int i = 0 ; i < n ; ++ i){
        for(int o = i ; o < n ; ++ o){

            if(j[i].r < j[o].r and j[o].bh == 1){
                j[i].r = 0;
                j[o].bh = 0;
                //cout << se << "fuck" << fi << endl;
                break;
            }
        }
    }
    int cnt = 0;
    //for(int i = 0 ; i < n ; ++ i){cout << j[i].bh << ' ' << j[i].r << endl;}
    for(int i = 0 ; i < n ; ++ i){
        if(j[i].bh == 0 or j[i].r > 0){
                if(j[i].bh == 0 and j[i].r == 0)continue;
            cnt++;

        }
    }
    cout << cnt;



    return 0;
}

